Evaluation of Root-n Bandwidth Selectors for Kernel Density Estimation
نویسندگان
چکیده
The kernel density estimator is used commonly for estimating animal utilization distributions from location data. This technique requires estimation of a bandwidth, for which ecologists often use least-squares cross-validation (LSCV). However, LSCV has large variance and a tendency to under-smooth data, and it fails to generate a bandwidth estimate in some situations. We compared performance of 2 new bandwidth estimators (root-n) versus that of LSCV using simulated data and location data from sharp-shinned hawks (Accipter striatus) and red wolves (Canis rufus). With simulated data containing no repeat locations, LSCV often produced a better fit between estimated and true utilization distributions than did root-n estimators on a case-by-case basis. On average, LSCV also provided lower positive relative error in home-range areas with small sample sizes of simulated data. However, root-n estimators tended to produce a better fit than LSCV on average because of extremely poor estimates generated on occasion by LSCV. Furthermore, the relative performance of LSCV decreased substantially as the number of repeat locations in the data increased. Root-n estimators also generally provided a better fit between utilization distributions generated from subsamples of hawk data and the local densities of locations from the full data sets. Least-squares cross-validation generated more unrealistically disjointed estimates of home ranges using real location data from red wolf packs. Most importantly, LSCV failed to generate home-range estimates for .20% of red wolf packs due to presence of repeat locations. We conclude that root-n estimators are superior to LSCV for larger data sets with repeat locations or other extreme clumping of data. In contrast, LSCV may be superior where the primary interest is in generating animal home ranges (rather than the utilization distribution) and data sets are small with limited clumping of locations.
منابع مشابه
A simple root n bandwidth selector
The asymptotically best bandwidth selectors for a kernel density estimator currently require the use of either unappealing higher order kernel pilot estimators or related Fourier transform methods. The point of this paper is to present a methodology which allows the fastest possible rate of convergence with the use of only nonnegative kernel estimators at all stages of the selection process. Th...
متن کاملLocal bandwidth selectors for deconvolution kernel density estimation
We consider kernel density estimation when the observations are contaminated by measurement errors. It is well known that the success of kernel estimators depends heavily on the choice of a smoothing parameter called the bandwidth. A number of data-driven bandwidth selectors exist in the literature, but they are all global. Such techniques are appropriate when the density is relatively simple, ...
متن کاملPractical bandwidth selection in deconvolution kernel density estimation
Kernel estimation of a density based on contaminated data is considered and the important issue of how to choose the bandwidth parameter in practice is discussed. Some plug-in (PI) type of bandwidth selectors, which are based on non-parametric estimation of an approximation of the mean integrated squared error, are proposed. The selectors are a re4nement of the simple normal reference bandwidth...
متن کاملFourier Series Based Bandwidth Selectors for Kernel Density Estimation
A class of Fourier series based plug-in bandwidth selectors for kernel density estimation is considered in this paper. The proposed data-dependent bandwidths are simple to obtain, easy to interpret and consistent for a wide class of compact supported distributions. Some of them present good finite sample comparative performances against the classical two-stage direct plug-in method or the least...
متن کاملFull bandwidth matrix selectors for gradient kernel density estimate
The most important factor in multivariate kernel density estimation is a choice of a bandwidth matrix. This choice is particularly important, because of its role in controlling both the amount and the direction of multivariate smoothing. Considerable attention has been paid to constrained parameterization of the bandwidth matrix such as a diagonal matrix or a pre-transformation of the data. A g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010